Artificial Intelligence Heuristic for Combinatorial Routing Problem

نویسندگان

  • R. Dhanalakshmi
  • T. Arunkumar
  • P. Parthiban
  • K. Ganesh
چکیده

The banking industry has initiated an assortment of new customer services and products using Information Technology (IT) systems. The banking industry has gone through many modifications as a consequence of the introduction of IT. In fact, the configuration of the industry is incessantly altering because of speedy expansion of IT. The sustained accomplishment of IT applications means that the boundaries of existing IT computer systems in banks have to be re-developed to meet future necessities. Some banks were at the cutting edge of IT and have a clear vision of how IT could be furthered applied successfully in increasing the operational efficiency of banks. This paper is concerned with the combinatorial routing problem arisen for banking industry. An artificial intelligence (AI) heuristic is developed to solve the combinatorial routing problem and it is compared with the complete enumerated data set. AI heuristic yielded better solution in reasonable computing time.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Design and Implementation of a Combinatorial Optimization Multi-population Meta-heuristic for Solving Vehicle Routing Problems

This paper aims to give a presentation of the PhD defended by Eneko Osaba on November 16th, 2015, at the University of Deusto. The thesis can be placed in the field of artificial intelligence. Specifically, it is related with multipopulation meta-heuristics for solving vehicle routing problems. The dissertation was held in the main auditorium of the University, in a publicly open presentation. ...

متن کامل

An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

متن کامل

An Improved Modified Tabu Search Algorithm to Solve the Vehicle Routing Problem with Simultaneous Pickup and Delivery

The vehicle routing problem with simultaneous pickup and delivery (VRPSPD) is a well-known combinatorial optimization problem which addresses provided service to a set of customers using a homogeneous fleet of capacitated vehicles. The objective is to minimize the distance traveled. The VRPSPD is an NP-hard combinatorial optimization problem. Therefore, practical large-scale instances of VR...

متن کامل

Hybrids of Ant Colony Optimization Algorithm - A Versatile Tool

Ant Colony Optimization Algorithm is a meta-heuristic, multi-agent technique that can be applied for solving difficult NP-Hard Combinatorial Optimization Problems like Traveling Salesman Problem (TSP), Job Shop Scheduling Problem (JSP), Vehicle Routing Problem (VRP) and many more. The Positive Feedback Mechanism and Distributed Computing ability makes it very robust in nature. The artificial an...

متن کامل

An Imperialist Competitive Algorithm and a Mixed Integer Programming Formulation for the Capacitated Vehicle Routing Problem

The Vehicle Routing Problem (VRP), a famous problem of operation research, holds a central place in combinatorial optimization problems. In this problem, a fleet vehicles with Q capacity start to move from depot and return after servicing to customers in which visit only ones each customer and load more than its capacity not at all. The objective is to minimize the number of used vehicles and t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • JITR

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2009